Symmetry-enforced straight nodal-line phonons
نویسندگان
چکیده
Based on first-principles calculations and effective model analysis, all possible straight nodal-line phonons in symmorphic space groups are uncovered. A classification of two-band ${\textbf{k}}\cdot {\textbf{p}}$ models at an arbitrary point the nodal lines is carried out, these found to locate along high symmetry Brillouin zone. According our classification, there two types groups. The first type possesses a linear dispersion perpendicular lines, while second exhibits quadratic dispersion. underlying mechanisms revealed by can be distinguished through little group lines. Our work not only classifies but also provides guidance search for topological bosonic systems.
منابع مشابه
Indexing Straight-Line Programs∗
Straight-line programs offer powerful text compression by representing a text T [1, u] in terms of a context-free grammar of n rules, so that T can be recovered in O(u) time. However, the problem of operating the grammar in compressed form has not been studied much. We present the first grammar representation able of extracting text substrings, and of searching the text for patterns, in time o(...
متن کاملStraight Line Triangle Representations
A straight line triangle representation (SLTR) of a planar graph is a straight line drawing such that all the faces including the outer face have triangular shape. Such a drawing can be viewed as a tiling of a triangle using triangles with the input graph as skeletal structure. In this paper we present a characterization of graphs that have an SLTR. The charcterization is based on flat angle as...
متن کاملStraight-Line Drawing of Quadrangulations
This article introduces a straight-line drawing algorithm for quadrangulations, in the family of the face-counting algorithms. It outputs in linear time a drawing on a regular W×H grid such that W+H = n − 1 −∆, where n is the number of vertices and ∆ is an explicit combinatorial parameter of the quadrangulation.
متن کاملStraight - Line Drawings on Restricted
This paper investigates the following question: Given an integer grid , where is a proper subset of the integer plane or a proper subset of the integer 3d space, which graphs admit straight-line crossing-free drawings with vertices located at the grid points of ? We characterize the trees that can be drawn on a two dimensional c n k grid, where k and c are given integer constants, and on a two ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2021
ISSN: ['1098-0121', '1550-235X', '1538-4489']
DOI: https://doi.org/10.1103/physrevb.104.024304